Formalizing a Switch of Burden of Proof by Logic Programming
نویسندگان
چکیده
Prakken [2] argues that we cannot formalize a switch of burden of proof in legal reasoning either by argumentation framework or by nonmonotonic reasoning since argumentation semantics can represent any nonmonotonic formalism. In this paper, we argue that a switch of burden of proof can be formalized in nonmonotonic reasoning by formalizing burden of proof in a different way followed by the Japanese civil procedure law.
منابع مشابه
Formalizing Semantics with an Automatic Program Verifier
A common belief is that formalizing semantics of programming languages requires the use of a proof assistant providing (1) a specification language with advanced features such as higher-order logic, inductive definitions, type polymorphism, and (2) a corresponding proof environment where higher-order and inductive reasoning can be performed, typically with user interaction. In this paper we sho...
متن کاملWeek 2 Title of the Course: Specication and Prototyping Using Higher-order Logic
Content of the course: This course introduces a logical approach to formalizing, prototyping and reasoning about computational systems. We shall consider systems from various contexts, including typing and evaluation notions for programming languages, logics and proof-theoretic principles, formally speci ed software and concurrency. A feature common to many of these systems is that they are pre...
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملGeneric Programming and Proving for Programming Language Metatheory
We present a system for both the generic programming of operations that work over classes of tree-structured data types and the automatic generation of formal type-theoretical proofs about such operations. The system is implemented in the Coq proof assistant, using dependent types to validate code and proof generation statically, quantified over all possible input data types. We focus on generi...
متن کاملA Case Study on Extracting the Characteristics of the Reachable States of a State Machine formalizing a Communication Protocol with Inductive Logic Programing
A distributed system DS can be formalized as a state machine M and many desired properties of DS can be expressed as invariants of M . An invariant of M is a state predicate p of M such that p holds for all reachable states of M . To verify that DS enjoys a desired property, namely to prove that p is an invariant of M , we often need to find other invariants as lemmas, which is one of the most ...
متن کامل